Interconnect model-order reduction method

ABSTRACT

An interconnect model-order reduction method for reduction of a nano-level semiconductor interconnect network as an original interconnect network by using iteration-based Arnoldi algorithms disclosed. The method is performed based on a projection method and has become a necessity for efficient interconnect modeling and simulations. To select order of the reduced-order model that can efficiently reflect essential dynamics of the original interconnect network, a residual error between transfer functions of the original interconnect network and the reduced interconnect model may be considered as a reference in determining if the iteration process should end, analytical expressions of the residual error being derived herein. Furthermore, the approximate transfer function of the reduced interconnect model may also be expressed as an addition of the original interconnect model and some additive perturbations. A perturbation matrix is only related with resultant vectors at a previous step of the Arnoldi algorithm. Therefore, the residual error information may be taken as a reference for the order selection scheme used in Krylov subspace model-order algorithm.

BACKGROUND OF THE INVENTION

1. Field of Invention

The present invention relates to an interconnect model-order reduction method. More particularly, the present invention relates to a rapid and accurate interconnect model-order reduction method for reduction of a nano-level semiconductor interconnect network for signal analysis.

2. Related Art

Complemented metal oxide semiconductor (CMOS) technology has heretofore advanced to be measured at nano-level and thus parasitic effect to interconnects of the related semiconductor device becomes inneglectable. Since complexity of circuit associated with the semiconductor device is increased, order of the corresponding interconnect model is also increased. Consequently, an efficient interconnect model-order reduction has become a necessity of modeling and simulation of the interconnect network. Such methods may be referred to in, for example, U.S. Pat. No. 6,023,573, U.S. Pat. No. 6,041,170 and U.S. Pat. No. 6,687,658. These circuit model-order reduction methods set forth in the recent years are herein summarized as follows. 1. Asymptotic waveform evaluation (AWE), which was set forth in an article by L. T. Pillage and R. A. Rohrer, entitled “Asymptotic waveform evaluation for timing analysis,” IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Vol. 9, No. 4, pp. 352-366, 1990. 2. Pade via Lanczos (PVL), which was set forth in an article by P. Feldmann and R. W. freund, entitled “Efficient linear circuit analysis by Pad'e approximation via the Lanczos process,” IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Vol. 14 pp. 639-649, 1995. 3. Symmetric Pad'e via Lanczos, which was set forth in an article set forth by P. Feldmann and R. W. Freund, entitled “The SyMPVL algorithm and its applications to interconnect simulation,” Proc. 1997 Int. Conf. on Simulation of Semiconductor Processes and Devices, pp. 113-116, 1997. 4. Block Arnoldi, which may be seen in U.S. Pat. No. 6,810,506. 5. Passive reduced-order interconnect macromodeling (PRIMA) method, which was set forth in an article by A. Odabasioglu, M. Celik and L. T. Pileggi, “PRIMA: passive reduced-order interconnect macromodeling algorithm,” IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Vol. 17 pp. 645-653, 1998.

The above methods are performed essentially based on Krylov Subspace projection method, in which state variables of an original system (original interconnect network for the above and both will be used through this specification) is projected to obtain state variables of a reduced-order system (reduced interconnect model for the above and both will be used through this specification) by use of a projection operand. The required projecter may be obtained by performing the iteration-based Krylov algorithm, in which iteration number required to be conducted is “order” of the reduce-order system. In this case, the order of the reduced-order system has to be determined in execution of the projection-based interconnect model reduction in such a manner that essential dynamics of the original system may be accurately reflected. The iteration process may be conducted by taking a residual error between transfer functions of the original system and the reduced-order system, respectively, as a reference for end of such iteration process, the residual error is defined as an error between the transfer functions of the original and reduced-order systems after specific times of iterations.

An example of deduction of the error E(s) between the transfer functions of the original and reduced-order systems may be seen in an article set forth by Z. Bai, R. D. Slone, W. T. Smith and Q. Ye, entitled “Error bound for reduced system model by Pad'e approximation via the Lanczos process,” IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Vol. 18 pp. 133-141, 1999. However, the error E(s) is involved with complicated computations of a resolvent matrix (I_(n)−sA)⁻¹ of the original system, making itself difficult to be used in a real application.

In light of the above, there are still some shortcomings inherent in the prior art and thus improvements therefor are in an urgent need. In this regard, the Inventors have paid many efforts in the related research by looking at the problems encountered in the prior art and finally developed successfully an efficient interconnect model-order reduction method taken as the present invention.

SUMMARY OF THE INVENTION

It is, therefore, an object to provide an interconnect model-order reduction method for reduction of a nano-level semiconductor interconnect network as an original interconnect network into a reduced interconnect model for signal analysis by using iteration-based Arnoldi algorithm, through which transfer functions of the original interconnect network and the reduced interconnect model is exempted from complicated computations and the reduced interconnect model may be achieved in a rapid and accurate manner.

To achieve the above object, the interconnect model-order reduction method for reduction of a nano-level semiconductor interconnect model into a reduced interconnect model for signal analysis by using the iteration-based Arnoldi algorithm comprises the steps of: inputting an interconnect network, inputting a set of frequency expansion points, establishing a state space matrix of the interconnect network and reducing the interconnect network into the reduced interconnect model by estimating a residual error.

In this method, the residual error between the original interconnect network and the reduced interconnect model is derived and the reduced interconnect model is deduced by the iteration-based Arnoldi algorithm. Further, the relationship between the residual error and the original interconnect network is presented.

In addition, the transfer function of the reduced interconnect model may be represented simply by adding some perturbations to the transfer function of the original interconnect network, in which a perturbation matrix is only related to resultant vectors obtained in the Arnoldi algorithm.

The thus derived error may efficiently provide a reference for order of the reduced interconnect model selected by Krylov subspace model reduction algorithm.

The following description is presented to enable one of ordinary skill in the art to make and use the present invention as provided within the context of a particular application and its requirements. Various modifications to the preferred embodiment will, however, be apparent to one skilled in the art, and the general principles defined herein may be applied to other embodiments. Therefore, the present invention is not intended to be limited to the particular embodiments shown and described herein, but is to be accorded the widest scope consistent with the principles and novel features herein disclosed.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a simple interconnect network according to an embodiment of the present invention;

FIG. 2 shows a comparison between H_(q+1,q) and μ_(q) after different iteration times q performed according to the present invention; and

FIG. 3 shows a comparison of three systems H(s), Ĥ(s) and H_(Δ)(s), after q times of iteration performed, according to the present invention.

DETAILED DESCRIPTION OF THE INVENTION

In analyzing a linear RLC interconnect network in an ultra-large semiconductor circuit (ULSI), modified nodal analysis (MNA) technology is generally utilized. In performing the MNA technology, the interconnect network may be first represented as the following state space-based equation: $\begin{matrix} {{{M\frac{\mathbb{d}{x(t)}}{\mathbb{d}t}} = {{- {{Nx}(t)}} + {{bu}(t)}}},{{y(t)} = {c^{T}{x(t)}}},} & {{Eq}.\quad(1)} \end{matrix}$ wherein M,N∈R^(n×n),x,b,c∈R^(n) and y(t)∈R; and wherein M is a matrix including capacitances and inductances therein, N is a matrix including electric conductivities and resistances therein, x(t) is a state matrix including node voltages and branch currents of an inductor therein, u(t) is an input signal and y(t) is an output signal.

Now, assuming A=N⁻¹M and r=N⁻¹b, Eq. (1) may be represented as the following equation: $\begin{matrix} {{{A\frac{\mathbb{d}{x(t)}}{\mathbb{d}t}} = {{x(t)} - {{ru}(t)}}},{{y(t)} = {c^{T}{{x(t)}.}}}} & \left( {{Eq}.\quad 2} \right) \end{matrix}$

Now, the original interconnect network is to be reduced so as to obtain a reduced interconnect network so that essential dynamics of the original interconnect network may be accurately reflected in a lower order. A state space matrix of the reduced interconnect model is given as the following equation: $\begin{matrix} {{{\hat{A}\frac{\mathbb{d}{\hat{x}(t)}}{\mathbb{d}t}} = {{\hat{x}(t)} - {\hat{r}{u(t)}}}},{{\hat{y}(t)} = {{\hat{c}}^{T}{\hat{x}(t)}}},} & \left( {{Eq}.\quad 3} \right) \end{matrix}$ wherein {circumflex over (x)}(t)∈R^(q),Â∈R^(q×q),{circumflex over (r)},ĉ∈R^(q) and q<<n.

Now letting X(s)=L[x(t)] and {circumflex over (X)}(s)=L[{circumflex over (x)}(t)] be impulse responses of the original interconnect network and the reduced interconnect model, respectively, in Lapalace domain. Then, X(s) and {circumflex over (x)}(s) may be represented as the following equation: X(s)=(I _(n) −sA)⁻¹ r and {circumflex over (X)}(s)=(I _(n) −sÂ)⁻¹ {circumflex over (r)}  (Eq.4) wherein I_(n) is an n×n unit matrix and I_(q) is a q×q unit matrix.

A transfer function H(s) of the original interconnect network and a transfer function Ĥ(s) of the reduced interconnect model are represented, respectively, as H(s)=c^(T)X(s) and Ĥ(s)=ĉ^(T){circumflex over (X)}(s).

A projection-based method is employed to project the state variables of the original interconnect network by use of a projector into the state variables of the reduced interconnect model, the orthogonal projector being generated by iteration-based Krylov subspace algorithm.

In the above, the Krylov subspace K_(q)(A,r) is generated by a combination of matrix A and r and represented by the following equation: K _(q)(A,r)≡span(r,Ar,Λ,A ^(q−1) r).  (Eq. 5)

Next, the Krylov subspace K_(q)(A,r) is subject to a modified Gram-Schmidt orthogonal iteration process through Arnoldi algorithm to generate a unit orthonormal basis, which is represented as the following equation: V_(q)=[v₁,v₂,Λ,v_(q)],  (Eq. 6) wherein V_(q) ^(T)V_(q)=I_(q). By performing the Arnoldi algorithm with q times of iteration, the following equation may be obtained: AV _(q) =V _(q) H _(q) +h _(q+1,q) v _(q+1) e _(q) ^(T),  (Eq. 7) wherein H_(q)∈R^(q×q) is an upper Hessenberg matrix H_(q), which is represented as follows. $\begin{matrix} {H_{q} = {\begin{bmatrix} h_{11} & h_{22} & \Lambda & \Lambda & h_{1q} \\ h_{21} & h_{22} & \Lambda & \Lambda & h_{2q} \\ 0 & h_{32} & h_{33} & \Lambda & M \\ M & O & O & O & M \\ 0 & \Lambda & 0 & h_{q,{q - 1}} & h_{qq} \end{bmatrix}.}} & \left( {{Eq}.\quad 8} \right) \end{matrix}$

After q times of iteration performed in the Arnoldi algorithm, a residual vector h_(q+1,q)v_(q+1) is obtained, which has a relationship with the last unit orthogonal vector, given as the following equation: Av _(q) =h _(1q) v ₁ +h _(2q) v ₂ +Λ+h _(qq) v _(q) +h _(q+1,q) v _(q+1),  (Eq. 9)

The newly generated vector v_(q+1) is orthogonal to the unit orthogonal matrix v_(q+1)V_(q) obtained in the last iteration, i.e. V_(q) ^(T)v_(q+1)=0. A vector e_(q) is the q^(th) column vector of the unit matrix I_(q). From this viewpoint, between the state variables of the original interconnect network and the reduced interconnect model exists the following relationship: x(t)=V _(q) {circumflex over (x)}(t),  (Eq. 10) wherein x(t) is a state variable in n dimensions for the original interconnect network and {circumflex over (x)}(t) is a state variable in q dimensions for the reduced interconnect model.

Substituting Eq. 7 into Eq. 2, the following transformation relationship may be obtained with Eq. 3 through derivations and computations: Â=V _(q) ^(T) AV _(q) =H _(q) , {circumflex over (r)}=V _(q) ^(T) r and ĉ=V _(q) ^(T) c  (Eq. 11)

Reducing the original interconnect network by means of such projection-based model-order reduction method has the advantages that dynamics of the original interconnect network may be maintained and stability and passiveness may be achieved.

Error Analysis

To estimate the error between transfer functions of the original interconnect network (Eq. 2) and the reduced interconnect model (Eq. 3), an analytical expression of an residual error E_(r)(s) has to be first defined: E _(r)(s)=(I _(n) −sA){tilde over (X)}(s)−r,  (Eq. 12) wherein {tilde over (X)}(s) is an approximate solution of X(s). If {tilde over (X)}(s)=X(s), then E_(r)(s)=0.

When the Arnoldi algorithm begins to be performed, the approximate solution {tilde over (X)}(s) of Eq. 4 has to fall within the Krylov subspace and {tilde over (X)}(s)=V_(q){circumflex over (X)}(s) in this case. The following discussion will be devoted to an ideal approximate solution of Eq. 4.

Now assuming the orthogonal matrix V_(q)and the corresponding upper Hessenberg matrix H_(q) in Eq. 6 are obtained after q times of iteration in performing the Arnoldi algorithm.

Next, letting {tilde over (X)}(s) is an approximate solution of X(s) and {circumflex over (X)}(s) is an approximate solution of X(s) after q times of iteration in performing the Arnoldi algorithm, i.e. {tilde over (X)}(s)=V_(q){circumflex over (X)}(s) and E_(r)(s) is the residual error, then the following statements are valid.

-   (a) If {tilde over (X)}(s)=V_(q){circumflex over     (X)}(s)=V_(q)(I_(q)−sH_(q))⁻¹V_(q) ^(T)r, then Galerkin condition is     valid.     V _(q) ^(T) E _(r)(s)=V _(q) ^(T){(I _(n) −sA){tilde over     (X)}(s)−r}=0.  (Eq. 13) -   (b) When the Galerkin condition is valid, the residual error     E_(r)(s) may be represented as:     E _(r)(s)=−sh _(q+1,q) v _(q+1) e _(q) ^(T)(I _(q) −sH _(q))⁻¹     {circumflex over (r)}.  (Eq. 14)     The valid statements above mentioned will be explained as follows.     After q times of iteration in performing the Arnoldi algorithm, the     original interconnect network may be deduced to the reduced     interconnect model as shown in Eq. 11.

(a) Since {tilde over (X)}(s)∈K_(q)(A,r), {tilde over (X)}(s) may be obtained through a linear combination of column vectors of V_(q), i.e. {tilde over (X)}(s)=V_(q)X_(q)(s), wherein X_(q)(s) is a coefficient. Herein, it is expected that {tilde over (X)}_(q)(s)={circumflex over (X)}(s). The residual error E_(r)(s) is represented as: E _(r)(s)=(I _(n) −sA)V _(q) X _(q)(s)−r.  (Eq. 15) By multifying Eq. 15 with a matrix V_(q) ^(T−) proceeding thereto, the following equation is obtained: $\begin{matrix} \begin{matrix} {{V_{q}^{T}\left\lbrack {{\left( {I_{n} - {sA}} \right)V_{q}{X_{q}(s)}} - r} \right\rbrack} = {V_{q}^{T}\left\lbrack {{V_{q}{X_{q}(s)}} - {{s\left( {{V_{q}H_{q}} + {h_{{q + 1},q}v_{q + 1}e_{q}^{T}}} \right)}{X_{q}(s)}} - r} \right\rbrack}} \\ {= {{\left( {I_{q} - {sH}_{q}} \right){X_{q}(s)}} - {\hat{r}.}}} \end{matrix} & \left( {{Eq}.\quad 16} \right) \end{matrix}$ Since the unit orthogonality inherent in the Arnoldi algorithm is used,the Galerkin condition is valid when X_(q)(s)={circumflex over (X)}(s).

(b) When the residual error is represented as the following equation: $\begin{matrix} \begin{matrix} {{E_{r}(s)} = {{\left( {I_{n} - {sA}} \right){V_{q}\left( {I_{q} - {sH}_{q}} \right)}^{- 1}\hat{r}} - r}} \\ {{= {{\left\lbrack {{V_{q}\left( {I_{q} - {sH}_{q}} \right)} - {{sh}_{{q + 1},q}v_{q + 1}e_{q}^{T}}} \right\rbrack\left( {I_{q} - {sH}_{q}} \right)^{- 1}V_{q}^{T}r} - r}},} \end{matrix} & \left( {{Eq}.\quad 17} \right) \end{matrix}$ the following equation may be obtained after algebraic operations: E _(r)(s)=−sh _(q+1,q) v _(q+1) e _(q) ^(T)(I _(q) −sH _(q))⁻¹ {circumflex over (r)},  (Eq. 18) wherein r∈span{V_(q)} and V_(q)V_(q) ^(T)r=r. Hitherto, the valid statements (a) and (b) have been explained completely.

Range of the error may be derived from the following equations. Assuming each eigenvalue of H_(q) is simple and may be decomposed as H_(q)=S_(q)Λ_(q)S_(q) ⁻¹, Eq. 14 may be simplified as: $\begin{matrix} \begin{matrix} {{E_{r}(s)} = {{- {sh}_{{q + 1},q}}v_{q + 1}e_{q}^{T}{S_{q}\left( {I_{q} - {s\quad\Lambda_{q}}} \right)}^{- 1}S_{q}^{- 1}\hat{r}}} \\ {{= {{- h_{{q + 1},q}}v_{q + 1}e_{q}^{T}S_{q}{Z(s)}S_{q}^{- 1}\hat{r}}},} \end{matrix} & \left( {{Eq}.\quad 19} \right) \end{matrix}$ wherein ${Z(s)} = {{{diag}\left\lbrack \frac{s}{1 - {s\quad\lambda_{i}}} \right\rbrack}_{i = 1}^{q}.}$ Since Z(s) is a high-pass matrix, ${{Z(s)}}_{\infty} = {\frac{1}{\underset{1 \leq i \leq q}{\min{\lambda_{i}}}}.}$

Now, a norm form is obtained with respect to Eq. 19, the following equation is obtained: $\begin{matrix} {{{{E_{r}(s)}}_{\infty} \leq {{\kappa\left( S_{q} \right)}\frac{1}{\underset{1 \leq i \leq q}{\min{\lambda_{i}}}}{h_{{q + 1},q}}{\hat{r}}_{2}}},} & \left( {{Eq}.\quad 20} \right) \end{matrix}$ wherein κ(·) is condition number of a subject matrix.

As can be known in the above, the error estimation is only related to κ(S_(q)), {circumflex over (r)} and h_(q+1,q). As compared to the error expressions set forth in the prior art, few of them takes cost of the required computations into consideration. Since although κ(S_(q)) may reflect perturbations existed in the MNA formula, computations therefor are quite time consuming. In this regard, only h_(q+1,q) is taken as a reference for order selection of the reduced interconnect model. In fact, h_(q+1,q) is not directly employed but $\mu_{q} = {\frac{h_{{q + 1},q}}{h_{q,{q - 1}}}}$ is otherwise used as a reference for end of the iteration process. If μ_(q) is sufficiently small, the reduced interconnect model is very similar to the original interconnect.

The operation of the iteration-based Arnoldi algorithm according to the present invention is described in detail below. At first, an initial value is given. Then, the iteration process is performed during which the order of the reduced interconnect model is incremented. In each iteration performed, a new unit orthogonal vector v_(q) is generated and a corresponding value $\mu_{q} = {\frac{h_{{q + 1},q}}{h_{q,{q - 1}}}}$ according to ethe present invention is computed. When μ_(q) is sufficiently small, the iteration process in the Arnoldi algorithm will end and the corresponding iteration times q is taken as an optimal order number of the reduced model.

The advantages of the present invention will be demonstrated and simulation results thereof will be presented through a simple embodiment provided below.

Additive Perturbations System

In the following, a reduced-order system comparable to Eq. 11 will be deduced by adding perturbations to the original system. $\begin{matrix} {{{\left( {A - \Delta} \right)\frac{\mathbb{d}{x_{\Delta}(t)}}{\mathbb{d}t}} = {{x_{\Delta}(t)} - {{ru}(t)}}},{{y_{\Delta}(t)} = {c^{T}{{x_{\Delta}(t)}.}}}} & \left( {{Eq}.\quad 21} \right) \end{matrix}$

Adding some perturbations into a transfer function of the original system may present a transfer function Ĥ(s) after approximation, as shown in FIG. 14. Under the condition shown in Eq. 21, a transfer function H_(Δ)(s) of the perturbation system is comparable to the transfer function Ĥ(s) of the reduced system. Δ=h_(q+1,q)v_(q+1)v_(q) ^(T).  (Eq. 22) This result will be explained in principle as follows.

Assuming X_(Δ)(s)=V_(q){circumflex over (X)}(s), the following equation may be derived: (I _(n) −s(A−Δ))⁻¹ r=V _(q)(I _(q) −sÂ)⁻¹ {circumflex over (r)}.  (Eq. 23) Next, (I_(n)−s(A−Δ)) is multified at the right and left sides of Eq. 23 and the following equation is obtaine r=(I _(n) −s(A−Δ))V _(q)(I _(q) −sÂ)⁻¹ {circumflex over (r)}=[V _(q) −s(V _(q) H _(q) +h _(q+1,q) v _(q+1) e _(q) ^(T))+sΔV _(q)](I _(q) −sÂ)⁻¹ V _(q) ^(T) r.  (Eq. 24) Then, Eq. 24 is multified with V_(q) ^(T) and then rearranged as: (I _(q) −sÂ)=I _(q) −s(H _(q) +h _(q+1,q) V _(q) ^(T) v _(q+1) e _(q) ^(T))+sV _(q) ^(T) ΔV _(q).  (Eq. 25) Finally, the following equation is obtained: V_(q) ^(T)ΔV_(q)=h_(q+1,q)V_(q) ^(T)v_(q+1)e_(q) ^(T),=h_(q+1,q)V_(q) ^(T)v_(q+1)e_(q) ^(T)V_(q) ^(T)V_(q)  (Eq. 26) and may be further simplified as X_(Δ)(s)=V_(q){circumflex over (X)}(s) with assumption of Δ=h_(q+1,q)v_(q+1)v_(q) ^(T). <The Simple Embodiment of the Present Invention>

In the following, the simple embodiment is provided for test and demonstration of the Arnold algorithm, which will be described with reference to FIG. 1 corresponding to an examplary RLC interconnect network having twelve wires therein.

Parameters of the wires are given as follows: resistor: 1.00/cm, capacitor: 5.0 pF/cm, inductor: 1.5 nH/cm; drive resistor: 30 and load capacitor: 1.0 pF. Further, each of the wires is 30 mm long and separated into 50 sub-wires. In this embodiment, a frequency range of 0-12 GHz is selected and a frequency response voltage V_(out) of the RLC interconnect network is determined.

When the Arnoldi algorithm begins to be performed, values of h_(q+1,q) and μ_(q) are recorded in sequence. The simulation results of the Arnoldi algorithm are shown in FIG. 2. As shown, it may be seen that when iteration number q in the Arnoldi algorithm is greater than 31, μ_(q) is relatively smaller. Accordingly, it is suggested that the order of the reduced interconnect model be set as 31. H(s), Ĥ(s) and H_(Δ)(s) represent the transfer function of the original interconnect model, the transfer function of the reduced interconnect model after being subject to the Arnoldi algorithm and the transfer function of the perturbation system of the original interconnect network.

Referring to FIG. 3, a comparison of the three systems H(s), Ĥ(s) and H_(Δ)(s), after q times of iteration performed, according to the present invention is shown therein. It may be ascertained that H_(Δ)(s) is equal to Ĥ(s).

In the present invention, the residual error between the original RLC interconnect network and the reduced interconnect model is deduced and the perturbation is demonstrated as capable of representing the transfer function after approximation when being added into the transfer function of the original interconnect network. Herein, since the perturbation matrix is only related to the resultant vectors obtained in a last iteration in the Arnoldi algorithm, amount of computation required therefor is very small. With respect to the thus generated residual error, a reference for order selection may be provided in the projection-based model reduction method.

While embodiments and applications of this invention have been shown and described, it would be apparent to those skilled in the art having the benefit of this disclosure that many more modifications than mentioned above are possible without departing from the inventive concepts herein. The invention, therefore, is not to be restricted except in the spirit of the appended claims and their equivalents. 

1. An interconnect model-order reduction method for reduction of a nano-level semiconductor interconnect network as an original interconnect network by using iteration-based Arnoldi algorithm, comprising the steps of: inputting an interconnect network; inputting a set of frequency expansion points; establishing a state space matrix of the interconnect network; and estimating a residual error and reducing the interconnect network as a reduced interconnect model based on the residual error.
 2. The method according to claim 1, wherein the step of estimating the residual error is achieved by using: (a) the Arnoldi algorithm containing Krylov subspace iteration method therein; (b) a perturbation system added into the original interconnect network; and (c) the residual error E_(r)(s)=(I_(n)−sA){tilde over (X)}(s)−r.
 3. The method according to claim 2, wherein the residual error is used to obtain the reduced interconnect model by using the Arnoldi algorithm containing the Krylov subspace iteration method through which consecutive iterations are performed to generate consecutive approximate reduced interconnect models with only one more iteration required for a newly generated approximate reduced interconnect model with an order higher than that of a last approximate reduced interconnect model among the consecutively generated approximate reduced interconnect models, with a result that complexity of computations of the consecutive iterations is lower than that of conventional non-iteration-based algorithms.
 4. The method according to claim 2, wherein the step of estimating the residual error is performed based on the addition of the perturbation system which is achieved by adding a predetermined amount of perturbations onto the original interconnect neetwork, through which a transfer function after approximation Ĥ(s) of the reduced interconnect model is represented as: ${{\left( {A - \Delta} \right)\frac{\mathbb{d}{x_{\Delta}(t)}}{\mathbb{d}t}} = {{x_{\Delta}(t)} - {{ru}(t)}}},{{y_{\Delta}(t)} = {c^{T}{x_{\Delta}(t)}}},$ and, if Δ=h_(q+1,q)v_(q+1)v_(q) ^(T) is valid, a transfer function H_(Δ)(s) of the perturbation system is comparable to the transfer function Ĥ(s) of the reduced interconnect model.
 5. The method according to claim 2, wherein the step of estimating the residual error E_(r)(s)=(I_(n)−sA){tilde over (X)}(s)−r is performed based on a unit orthogonality of the Arnoldi algorithm, wherein the residual error is represented as E_(r)(s) = (I_(n) − sA)V_(q)(I_(q) − sH_(q))⁻¹r̂ − r = [V_(q)(I_(q) − sH_(q)) − sh_(q + 1, q)v_(q + 1)e_(q)^(T)](I_(q) − sH_(q))⁻¹V_(q)^(T)r − r, and then, after algebraic operations, as E _(r)(s)=−sh _(q+1,q) v _(q+1) e _(q) ^(T)(I _(q) −sH _(q))^(−S) _(q) ⁻¹ {circumflex over (r)}. 